package com.wfm.leetcode.editor.cn;
public class P剑指Offer10I斐波那契数列{
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int fib(int n) {
        if (n < 2) {
            return n;
        }
        int[] dp =new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for (int i = 2; i <= n; i++) {
            dp[i]=(dp[i-1]+dp[i-2])%1000000007;
        }
        return dp[n];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new P剑指Offer10I斐波那契数列().new Solution();
        System.out.println(solution.fib(5));
    }
}